Temporal Probabilistic Logic Programs: State and Revision
نویسنده
چکیده
There are numerous applications where we have to deal with temporal uncertainty associated with events. The Temporal Probabilistic (TP) Logic Programs should provide support for valid-time indeterminacy of events, by proposing the concept of an indeterminate instant, that is, an interval of time-points (event’s time-window) with an associated, lower and upper, probability distribution. In particular, we propose the new semantics, for the TP Logic Programs of Dekhtyar and Subrahmanian. Our semantics, based on the possible world semantics is a generalization of the possible world semantics for (non temporal) Probabilistic Logic Programming, and we define the new syntax for PT-programs, with time variable explicitly represented in all atoms, and show how the standard role of Herbrand interpretations used as possible worlds for probability distributions is coherently extended to Temporal Probabilistic Logic Programming.
منابع مشابه
Probabilistic Propositional Temporal Logics
We present two (closely-related) propositional probabilistic temporal logics based on temporal logics of branching time as introduced The first logic, PTLf, is interpreted over finite models, while the second logic, PTLb, which is an extension of the first one, is interpreted over infinite models with transition probabilities bounded away from O. The logic PTLf allows us to reason about finite-...
متن کاملModel Revision from Temporal Logic Properties in Computational Systems Biology
Systems biologists build models of bio-molecular processes from knowledge acquired both at the gene and protein levels, and at the phenotype level through experiments done in wild-life and mutated organisms. In this chapter, we present qualitative and quantitative logic learning tools, and illustrate how they can be useful to the modeler. We focus on biochemical reaction models written in the S...
متن کاملAbduction in Annotated Probabilistic Temporal Logic
Annotated Probabilistic Temporal (APT) logic programs are a form of logic programs that allow users to state (or systems to automatically learn) rules of the form “formula G becomes true K time units after formula F became true with L to U% probability.” In this paper, we develop a theory of abduction for APT logic programs. Specifically, given an APT logic program Π, a set of formulas H that c...
متن کاملBelief Revision through Forgetting Conditionals in Conditional Probabilistic Logic Programs
In this paper, we present a revision strategy of revising a conditional probabilistic logic program (PLP) when new information is received (which is in the form of probabilistic formulae), through the technique of variable forgetting.We first extend the traditional forgetting method to forget a conditional event in PLPs. We then propose two revision operators to revise a PLP based on our forget...
متن کاملBelief Revision in Structured Probabilistic Argumentation Model and Application to Cyber Security
In real-world applications, knowledge bases consisting of all the available information for a specific domain, along with the current state of affairs, will typically contain contradictory data, coming from different sources, as well as data with varying degrees of uncertainty attached. An important aspect of the effort associated with maintaining such knowledge bases is deciding what informati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007